A FETI method with a mesh independent condition number for the iteration matrix
نویسندگان
چکیده
منابع مشابه
A stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملA STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT
The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...
متن کاملSubspaces that Minimize the Condition Number of a Matrix
We define the condition number of a nonsingular matrix on a subspace, and consider the problem of finding a subspace of given dimension that minimizes the condition number of a given matrix. We give a general solution to this problem, and show in particular that when the given dimension is less than half the dimension of the matrix, a subspace can be found on which the condition number of the m...
متن کاملMinimizing the Condition Number of a Gram Matrix
The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the polynomial approximation. Given a polynomial basis, we consider the problem of finding a set of points and/or weights which minimizes the condition number of the Gram matrix. We use smoothing methods to solve such minimization problems and show the global conve...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2008
ISSN: 0045-7825
DOI: 10.1016/j.cma.2007.11.019